JOURNAL ISSUE published 1 January 2006 in ACM Transactions on Algorithms

Scheduling When You Do Not Know the Number of Machines

JOURNAL ARTICLE published 31 January 2020 in ACM Transactions on Algorithms

Research funded by NSF (CCF-1421161 and CCF-1714818)

Authors: Clifford Stein | Mingxian Zhong

Set connectivity problems in undirected graphs and the directed steiner network problem

JOURNAL ARTICLE published March 2011 in ACM Transactions on Algorithms

Research funded by United States-Israel Binational Science Foundation (2002276) | Division of Computing and Communication Foundations (CCF-0728782CNS-0721899CCF-0448095CCF-0729022) | Division of Computer and Network Systems (CCF-0728782CNS-0721899CCF-0448095CCF-0729022)

Authors: Chandra Chekuri | Guy Even | Anupam Gupta | Danny Segev

JOURNAL ISSUE published 1 April 2006 in ACM Transactions on Algorithms

Structure and linear-time recognition of 4-leaf powers

JOURNAL ARTICLE published November 2008 in ACM Transactions on Algorithms

Authors: Andreas Brandstädt | Van Bang Le | R. Sritharan

JOURNAL ISSUE published 17 November 2014 in ACM Transactions on Algorithms

JOURNAL ISSUE published 1 July 2011 in ACM Transactions on Algorithms

JOURNAL ISSUE published 1 September 2013 in ACM Transactions on Algorithms

Labeling schemes for vertex connectivity

JOURNAL ARTICLE published March 2010 in ACM Transactions on Algorithms

Authors: Amos Korman

Resilient dictionaries

JOURNAL ARTICLE published December 2009 in ACM Transactions on Algorithms

Authors: Irene Finocchi | Fabrizio Grandoni | Giuseppe F. Italiano

Robust Algorithms for TSP and Steiner Tree

JOURNAL ARTICLE published 30 April 2023 in ACM Transactions on Algorithms

Research funded by NSF (CCF-1535989) | NSF (CCF-1535972) | NSF (CCF-1535972, CCF-1955703) | NSF CAREER (CCF-1750140)

Authors: Arun Ganesh | Bruce M. Maggs | Debmalya Panigrahi

Tight Bounds for ℓ ₁ Oblivious Subspace Embeddings

JOURNAL ARTICLE published 31 January 2022 in ACM Transactions on Algorithms

Research funded by Office of Naval Research (N00014-18-1-2562)

Authors: Ruosong Wang | David P. Woodruff

JOURNAL ISSUE published 1 March 2013 in ACM Transactions on Algorithms

Optimal lower bounds for projective list update algorithms

JOURNAL ARTICLE published September 2013 in ACM Transactions on Algorithms

Research funded by Hasler Stiftung (11099)

Authors: Christoph Ambühl | Bernd Gärtner | Bernhard von Stengel

Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions

JOURNAL ARTICLE published 30 April 2023 in ACM Transactions on Algorithms

Research funded by NSF (CCF-1527084) | NSF (CCF-1527084, CCF-1535972) | NSF CAREER (CCF-1750140)

Authors: Kyle Fox | Debmalya Panigrahi | Fred Zhang

Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020

JOURNAL ARTICLE published 31 October 2022 in ACM Transactions on Algorithms

Authors: Gautam Kamath | Sepehr Assadi | Anne Driemel | Janardhan Kulkarni

Dynamic Geometric Set Cover and Hitting Set

JOURNAL ARTICLE published 31 October 2022 in ACM Transactions on Algorithms

Authors: Pankaj Agarwal | Hsien-Chih Chang | Subhash Suri | Allen Xiao | Jie Xue

Wireless scheduling with power control

JOURNAL ARTICLE published December 2012 in ACM Transactions on Algorithms

Research funded by Icelandic Centre for Research (90032021)

Authors: Magnús M. Halldórsson

Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs

JOURNAL ARTICLE published 31 July 2018 in ACM Transactions on Algorithms

Research funded by Agence Nationale de la Recherche (ANR16-CE40-0028)

Authors: Florian Barbero | Christophe Paul | MichaŁ Pilipczuk

The NP-completeness column

JOURNAL ARTICLE published July 2005 in ACM Transactions on Algorithms

Authors: David S. Johnson